Numerical Solution of Large and Sparse Continuous Time Algebraic Matrix Riccati and Lyapunov Equa- tions: A State of the Art Survey

Efficient numerical algorithms for the solution of large and sparse matrix Riccati and Lyapunov equations based on the low rank alternating directions implicit (ADI) iteration have become available around the year 2000. Over the decade that passed since then, additional methods based on extended and rational Krylov subspace projection have entered the field and proved to be competitive alternatives. In this survey we sketch both types of methods and discuss their advantages and drawbacks. We focus on the continuous time case here, but corresponding results for discrete time problems can for most results be found in the available literature and will be referred to throughout the paper.